Compiling gate networks on an Ising quantum computer
نویسندگان
چکیده
منابع مشابه
Simulating Ising spin glasses on a quantum computer
A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum probability equal to the corresponding thermodynamic weight. The partition function is thus approximated efficiently. The algorithm neither suffers from critical slowi...
متن کاملGeneralized Quantum Control-Not Gate in Two-Spin Ising System
The physical implementation of the quantum Control-Not gate for a two-spin system is investigated numerically. The concept of a generalized quantum Control-Not gate, with arbitrary phase shift, is introduced. It is shown that a resonant π-pulse provides a simple example of a generalized quantum Control-Not gate.
متن کاملBuckyball Quantum Computer: Realization of a Quantum Gate
We have studied a system composed by two endohedral fullerene molecules. We have found that this system can be used as good candidate for the realization of Quantum Gates. Each of these molecules encapsules an atom carrying a spin, therefore they interact through the spin dipole interaction. We show that a phase gate can be realized if we apply static and time dependent magnetic fields on each ...
متن کاملQuantum Circuit Designs for Gate-Model Quantum Computer Architectures
The power of quantum computers makes it possible to solve difficult problems more efficiently than is possible with traditional computers. Gate-model quantum computers provide an experimentally implementable architecture for quantum circuit computations. Here, we demonstrate an automated method for designing quantum circuits for experimental gate-model quantum computers. We define the Quantum T...
متن کاملAn algorithm for simulating the Ising model on a type-II quantum computer
Presented here is an algorithm for a type-II quantum computer which simulates the Ising model in one and two dimensions. It is equivalent to the Metropolis MonteCarlo method and takes advantage of quantum superposition for random number generation. This algorithm does not require the ensemble of states to be measured at the end of each iteration, as is required for other type-II algorithms. Onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2005
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.72.032315